Invertible Extractors and Wiretap Protocols

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combinatorial characterizations of extractors and Kolmogorov extractors

We present characterizations of extractors and Kolmogorov extractors in terms of a combinatorial object called balanced table. These characterizations provide an alternative proof for the relation between extractors and Kolmogorov extractors, first obtained in [FHP06] and [HPV09].

متن کامل

Two-Source Extractors for Quasi-Logarithmic Min-Entropy and Improved Privacy Amplification Protocols

This paper offers the following contributions: • We construct a two-source extractor for quasi-logarithmic min-entropy. That is, an extractor for two independent n-bit sources with min-entropy Õ(log n). Our construction is optimal up to poly(log log n) factors and improves upon a recent result by Ben-Aroya, Doron, and Ta-Shma (ECCC’16) that can handle min-entropy log n · 2 √ log . • A central p...

متن کامل

Computational Extractors and Pseudorandomness

Computational extractors are efficient procedures that map a source of sufficiently high min-entropy to an output that is computationally indistinguishable from uniform. By relaxing the statistical closeness property of traditional randomness extractors one hopes to improve the efficiency and entropy parameters of these extractors, while keeping their utility for cryptographic applications. In ...

متن کامل

Dimension Extractors

A dimension extractor is an algorithm designed to increase the effective dimension – i.e., the computational information density – of an infinite sequence. A constructive dimension extractor is exhibited by showing that every sequence of positive constructive dimension is Turing equivalent to a sequence of constructive strong dimension arbitrarily close to 1. Similar results are shown for compu...

متن کامل

Fuzzy Extractors

This chapter presents a general approach for handling secret biometric data in cryptographic applications. The generality manifests itself in two ways: we attempt to minimize the assumptions we make about the data, and to present techniques that are broadly applicable wherever biometric inputs are used. Because biometric data comes from a variety of sources that are mostly outside of anyone’s c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2012

ISSN: 0018-9448,1557-9654

DOI: 10.1109/tit.2011.2170660